A Column Generation Approach for Graph Coloring
نویسندگان
چکیده
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for each independent set in the graph). We use a column generation method for implicit optimization of the linear program at each node of the branch-and-bound tree. This approach, while requiring the solution of a diicult subproblem as well as needing sophisticated branching rules, solves small to moderate size problems quickly. We have also implemented an exact graph coloring algorithm based on DSATUR for comparison. Implementation details and computational experience are presented.
منابع مشابه
Graph Coloring via Constraint Programming-based Column Generation
This paper presents a Constraint Programming-based Column Generation approach to the Minimum Graph Coloring problem. The proposed approach has two versions of the pricing subproblems: the first version formulates the pricing subproblem as the optimization problem of finding the most negative reduced cost column, the second version as the decision problem of finding a maximal stable set with neg...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملExact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
We consider two approaches for solving the classical minimum vertex coloring problem, that is the problem of coloring the vertices of a graph so that adjacent vertices have different colors, minimizing the number of used colors, namely Constraint Programming and Column Generation. Constraint Programming is able to solve very efficiently many of the benchmarks, but suffers from the lack of effec...
متن کاملA Branch-and-Price Approach for Graph Multi-Coloring
We present a branch-and-price framework for solving the graph multicoloring problem. We propose column generation to implicitly optimize the linear programming relaxation of an independent set formulation (where there is one variable for each independent set in the graph) for graph multi-coloring. This approach, while requiring the solution of a difficult subproblem, is a promising method to ob...
متن کاملConstructive Genetic Algorithm and Column Generation: an Application to Graph Coloring
We present a combined use of Genetic Algorithms (GAs) and column generation to approximately solve graph-coloring problems. The proposed method is divided in two phases. The constructive phase builds the initial pool of columns using a Constructive Genetic Algorithm (CGA). Each column forms an independent set. The second phase solves by column generation the set covering formulation. The column...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- INFORMS Journal on Computing
دوره 8 شماره
صفحات -
تاریخ انتشار 1996